def add_two_numbers(a, b):
    return a + b


print(add_two_numbers(10, 22))


def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
        return True


print(is_prime(23))


# for i in range(1,100):
#
#         print(i)

# print(i)

# 用递归实现阶乘
def factorial(n: int) -> int:
    """
    计算一个非负整数的阶乘。

    参数:
    n (int): 非负整数

    返回:
    int: n 的阶乘
    """
    # 检查输入是否为非负整数
    if not isinstance(n, int) or n < 0:
        raise ValueError("Input must be a non-negative integer.")

    # 边界条件
    if n == 0:
        return 1

    # 迭代计算阶乘
    result = 1
    for i in range(1, n + 1):
        result *= i
    return result
